Solving the multi-level location routing problem considering the environmental impact using a hybrid metaheuristic
نویسندگان
چکیده
The multi-level location routing problem (MLLRP) is an extension of the capacitated (CLRP). MLLRPs are considered a class combinatorial optimization problems that arise in transportation applications, such as agricultural logistic planning. Along with concerns regarding environmental harmfulness, recent studies have “green” logistics. This paper addressed low impact model for MLLRP by considering characteristics, emissions, and traffic congestion not appeared literature. mathematical was formulated to deal reverse flow problem, which real case occurs Thailand agriculture. We developed hybrid metaheuristic algorithm solve integrating variable neighborhood search (VNS) adaptive large (ALNS). experimental results shown had clear advantages time consumption quality solution. extended study indicated proposed obtained competitive compared previously published methods. practice useful only industry but also other industries.
منابع مشابه
A hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کاملA Hybrid Metaheuristic Algorithm for the Capacitated Location- Routing Problem
This paper presents a new metahaheuristic algorithm to solve the capacitated locationrouting problem (CLRP). We are given on input a set of identical vehicles, a set of depots with restricted capacities and opening costs, and a set of customers with deterministic demands. The problem consists of determining the depots to be opened, the customers and the vehicles to be assigned to each open depo...
متن کاملA hybrid metaheuristic algorithm for solving a rollon–rolloff waste collection vehicle routing problem considering waste separation and recycling center
This paper addresses a rollon–rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers’ locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of engineering business management
سال: 2021
ISSN: ['1847-9790']
DOI: https://doi.org/10.1177/18479790211017353